Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems
نویسندگان
چکیده
ion and Counterexample-Guided Refinement in Model Checking of Hybrid Systems∗ Edmund Clarke, Ansgar Fehnker, Zhi Han, Bruce Krogh, Joël Ouaknine, Olaf Stursberg, Michael Theobald 1 Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213, USA 2 Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA 15213, USA 3 Process Control Lab, University of Dortmund, Germany
منابع مشابه
Verification of Hybrid Systems Based on Counterexample-Guided Abstraction Refinement
Hybrid dynamic systems include both continuous and discrete state variables. Properties of hybrid systems, which have an infinite state space, can often be verified using ordinary model checking together with a finite-state abstraction. Model checking can be inconclusive, however, in which case the abstraction must be refined. This paper presents a new procedure to perform this refinement opera...
متن کاملCounterexample Guided Abstraction Refinement for Stability Analysis
In this paper, we present a counterexample guided abstraction refinement (Cegar) algorithm for stability analysis of polyhedral hybrid systems. Our results build upon a quantitative predicate abstraction and model-checking algorithm for stability analysis, which returns a counterexample indicating a potential reason for instability. The main contributions of this paper include the validation of...
متن کاملAdvances in counterexample-guided abstraction refinement
This report is a collection of six articles on model checking in the abstraction/refinement framework. This framework is used by various techniques for tackling the state-space explosion problem that is frequently encountered in model checking. The articles collected in this report are (in order of appearance): 1. Counterexample-guided abstraction refinement. Clarke, Grumberg, Jha, Lu, Veith[2]...
متن کاملHeuristic-Guided Abstraction Refinement
Model checking has been considered as a promising approach to establish the correctness of systems. Counterexample-guided abstraction refinement is a key strategy for model checking in verification of large-scale systems. State separation problem poses the main hurdle during the refinement. We present two fast heuristics to solve this problem. We prove the effectiveness of our heuristics by bot...
متن کاملProperty-Driven Partitioning for Abstraction Refinement
Partitioning and abstraction have been studied extensively both in hardware and in software verification. The abstraction is typically partitioned according to the system design in the case of hardware or the control graph in the case of software. In this work we build on previous work on Property-Driven Partitioning (PDP), a hybrid Symbolic Model-Checking (SMC) technique for ωregular propertie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 14 شماره
صفحات -
تاریخ انتشار 2003